Bipolar Preference Problems: Framework, Properties and Solving Techniques
Identifieur interne : 001A68 ( Main/Exploration ); précédent : 001A67; suivant : 001A69Bipolar Preference Problems: Framework, Properties and Solving Techniques
Auteurs : Stefano Bistarelli [Italie] ; Maria Silvia Pini [Italie] ; Francesca Rossi [Italie] ; K. Brent Venable [Italie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemingly specular notions, these two kinds of preferences should be dealt with differently to obtain the desired natural behaviour. We technically address this by generalizing the soft constraint formalism, which is able to model problems with one kind of preferences. We show that soft constraints model only negative preferences, and we define a new mathematical structure which allows to handle positive preferences as well. We also address the issue of the compensation between positive and negative preferences, studying the properties of this operation. Finally, we extend the notion of arc consistency to bipolar problems, and we show how branch and bound (with or without constraint propagation) can be easily adapted to solve such problems.
Url:
DOI: 10.1007/978-3-540-73817-6_5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000D78
- to stream Istex, to step Curation: 000D78
- to stream Istex, to step Checkpoint: 001094
- to stream Main, to step Merge: 001A76
- to stream Main, to step Curation: 001A68
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Bipolar Preference Problems: Framework, Properties and Solving Techniques</title>
<author><name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
</author>
<author><name sortKey="Pini, Maria Silvia" sort="Pini, Maria Silvia" uniqKey="Pini M" first="Maria Silvia" last="Pini">Maria Silvia Pini</name>
</author>
<author><name sortKey="Rossi, Francesca" sort="Rossi, Francesca" uniqKey="Rossi F" first="Francesca" last="Rossi">Francesca Rossi</name>
</author>
<author><name sortKey="Venable, K Brent" sort="Venable, K Brent" uniqKey="Venable K" first="K. Brent" last="Venable">K. Brent Venable</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:75B56A57D77CF55963CEF8DF79CDB4AEB24CE2D4</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/978-3-540-73817-6_5</idno>
<idno type="url">https://api.istex.fr/document/75B56A57D77CF55963CEF8DF79CDB4AEB24CE2D4/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000D78</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000D78</idno>
<idno type="wicri:Area/Istex/Curation">000D78</idno>
<idno type="wicri:Area/Istex/Checkpoint">001094</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001094</idno>
<idno type="wicri:doubleKey">0302-9743:2007:Bistarelli S:bipolar:preference:problems</idno>
<idno type="wicri:Area/Main/Merge">001A76</idno>
<idno type="wicri:Area/Main/Curation">001A68</idno>
<idno type="wicri:Area/Main/Exploration">001A68</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Bipolar Preference Problems: Framework, Properties and Solving Techniques</title>
<author><name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<affiliation wicri:level="1"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara</wicri:regionArea>
<wicri:noRegion>Pescara</wicri:noRegion>
</affiliation>
<affiliation wicri:level="3"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Istituto di Informatica e Telematica, CNR, Pisa</wicri:regionArea>
<placeName><settlement type="city">Pise</settlement>
<region nuts="2">Toscane</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Italie</country>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author><name sortKey="Pini, Maria Silvia" sort="Pini, Maria Silvia" uniqKey="Pini M" first="Maria Silvia" last="Pini">Maria Silvia Pini</name>
<affiliation wicri:level="4"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Matematica Pura ed Applicata, Università di Padova</wicri:regionArea>
<placeName><settlement type="city">Padoue</settlement>
<region type="region" nuts="2">Vénétie</region>
</placeName>
<orgName type="university">Université de Padoue</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author><name sortKey="Rossi, Francesca" sort="Rossi, Francesca" uniqKey="Rossi F" first="Francesca" last="Rossi">Francesca Rossi</name>
<affiliation wicri:level="4"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Matematica Pura ed Applicata, Università di Padova</wicri:regionArea>
<placeName><settlement type="city">Padoue</settlement>
<region type="region" nuts="2">Vénétie</region>
</placeName>
<orgName type="university">Université de Padoue</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author><name sortKey="Venable, K Brent" sort="Venable, K Brent" uniqKey="Venable K" first="K. Brent" last="Venable">K. Brent Venable</name>
<affiliation wicri:level="4"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Matematica Pura ed Applicata, Università di Padova</wicri:regionArea>
<placeName><settlement type="city">Padoue</settlement>
<region type="region" nuts="2">Vénétie</region>
</placeName>
<orgName type="university">Université de Padoue</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Italie</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2007</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">75B56A57D77CF55963CEF8DF79CDB4AEB24CE2D4</idno>
<idno type="DOI">10.1007/978-3-540-73817-6_5</idno>
<idno type="ChapterID">5</idno>
<idno type="ChapterID">Chap5</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemingly specular notions, these two kinds of preferences should be dealt with differently to obtain the desired natural behaviour. We technically address this by generalizing the soft constraint formalism, which is able to model problems with one kind of preferences. We show that soft constraints model only negative preferences, and we define a new mathematical structure which allows to handle positive preferences as well. We also address the issue of the compensation between positive and negative preferences, studying the properties of this operation. Finally, we extend the notion of arc consistency to bipolar problems, and we show how branch and bound (with or without constraint propagation) can be easily adapted to solve such problems.</div>
</front>
</TEI>
<affiliations><list><country><li>Italie</li>
</country>
<region><li>Toscane</li>
<li>Vénétie</li>
</region>
<settlement><li>Padoue</li>
<li>Pise</li>
</settlement>
<orgName><li>Université de Padoue</li>
</orgName>
</list>
<tree><country name="Italie"><noRegion><name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
</noRegion>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Pini, Maria Silvia" sort="Pini, Maria Silvia" uniqKey="Pini M" first="Maria Silvia" last="Pini">Maria Silvia Pini</name>
<name sortKey="Pini, Maria Silvia" sort="Pini, Maria Silvia" uniqKey="Pini M" first="Maria Silvia" last="Pini">Maria Silvia Pini</name>
<name sortKey="Rossi, Francesca" sort="Rossi, Francesca" uniqKey="Rossi F" first="Francesca" last="Rossi">Francesca Rossi</name>
<name sortKey="Rossi, Francesca" sort="Rossi, Francesca" uniqKey="Rossi F" first="Francesca" last="Rossi">Francesca Rossi</name>
<name sortKey="Venable, K Brent" sort="Venable, K Brent" uniqKey="Venable K" first="K. Brent" last="Venable">K. Brent Venable</name>
<name sortKey="Venable, K Brent" sort="Venable, K Brent" uniqKey="Venable K" first="K. Brent" last="Venable">K. Brent Venable</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001A68 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001A68 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= TelematiV1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:75B56A57D77CF55963CEF8DF79CDB4AEB24CE2D4 |texte= Bipolar Preference Problems: Framework, Properties and Solving Techniques }}
This area was generated with Dilib version V0.6.31. |